Computational Soundness about Formal Encryption in Presence of Secret Shares and Key Cycles
نویسندگان
چکیده
The computational soundness of formal encryption is researched extensively after the work by Abadi and Rogaway. A recent work by Abadi and Warinschi extends this work to a scenario in which secret sharing is used. A more recent work by Micciancio extends this work to deal the formal encryption in presence of key cycles by using of co-induction definition of the adversarial knowledge. In this paper, we prove a computational soundness theorem of formal encryption which is in presence of both key cycles and secret shares.
منابع مشابه
Computational Soundness about Formal Encryption in the Presence of Secret Shares and Key Cycles
The computational soundness of formal encryption is studied extensively following the work of Abadi and Rogaway[1]. Recent work considers the scenario in which secret sharing is needed, and separately, the scenario when key cycles are present. The novel technique is the use of a co-induction definition of the adversarial knowledge. In this paper, we prove a computational soundness theorem of fo...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملSoundness of Formal Encryption in the Presence of Key-Cycles
Both the formal and the computational models of cryptography contain the notion of message equivalence or indistinguishability. An encryption scheme provides soundness for indistinguishability if, when mapping formal messages into the computational model, equivalent formal messages are mapped to indistinguishable computational distributions. Previous soundness results are limited in that they d...
متن کاملSoundness and completeness of formal encryption: The cases of key cycles and partial information leakage
In their seminal work, Abadi and Rogaway [2, 3] show that the formal (Dolev-Yao) notion of indistinguishability is sound with respect to the computational model: messages that are indistinguishable in the formal model become indistinguishable messages in the computational model. However, this result leaves two problems unsolved. First, it cannot tolerate key cycles. Second, it makes the too-str...
متن کاملSoundness and Completeness of Formal Encryption: the Cases of Key-Cycles and Partial Information Leakage (Preliminary Version)
In their seminal work, Abadi and Rogaway [2, 3] show that the formal (Dolev-Yao) notion of indistinguishability is sound with respect to the computational model: pairs of messages that are indistinguishable in the formal model become indistinguishable messages in the computational model. However, this result has two weaknesses. First, it cannot tolerate key-cycles. Second, it makes the too-stro...
متن کامل